Cryptography for Multi-Located Parties
نویسنده
چکیده
This note describes some cryptographic issues related to multi‐located parties. In general, multi‐located parties make it difficult for the eavesdropper to mount the man‐in‐the‐ middle attack. Conversely, they make it easier to address problems such as joint encryption and error correction coding. It is easier to implement the three‐stage quantum cryptography protocol.
منابع مشابه
A new protocol implementing authentication transformations for multi-located parties
This paper discusses a new protocol implementing authentication in a multi-located environment that avoids man-in-the-middle (MIM) attack, replay attack and provides privacy, integrity of a message for multi-located parties. The protocol uses the concept that each party is associated with a subsidiary agent.
متن کاملSTUDIES ON FAULT - TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor
Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...
متن کاملStudies on Fault-tolerant Broadcast and Secure Computation
Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...
متن کاملEfficient Two Party Multi-prime Rsa Key Generation
We present a new protocol which enables two parties to jointly generate a multi-prime RSA key pair such that neither party gains information about the secret key. The expected running time of our algorithm is linear in the bit length of the modulus which is significantly faster than previously known methods.
متن کاملPrivacy Preserving PageRank Algorithm By Using Secure Multi-Party Computation
In this work, we study the problem of privacy preserving computation on PageRank algorithm. The idea is to enforce the secure multi party computation of the algorithm iteratively using homomorphic encryption based on Paillier scheme. In the proposed PageRank computation, a user encrypt its own graph data using asymmetric encryption method, sends the data set into different parties in a privacy-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.2977 شماره
صفحات -
تاریخ انتشار 2009